Перевод: со всех языков на все языки

со всех языков на все языки

aperiodic network

См. также в других словарях:

  • aperiodic circuit — aperiodinė grandinė statusas T sritis automatika atitikmenys: angl. aperiodic circuit; lag network vok. aperiodischer Kreis, m; aperiodischer Stromkreis, m rus. апериодическая сеть, f; апериодическая цепь, f; апериодический контур, m pranc.… …   Automatikos terminų žodynas

  • lag network — aperiodinė grandinė statusas T sritis automatika atitikmenys: angl. aperiodic circuit; lag network vok. aperiodischer Kreis, m; aperiodischer Stromkreis, m rus. апериодическая сеть, f; апериодическая цепь, f; апериодический контур, m pranc.… …   Automatikos terminų žodynas

  • Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • Road coloring problem — In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from… …   Wikipedia

  • List of electronics topics — Alphabetization has been neglected in some parts of this article (the b section in particular). You can help by editing it. This is a list of communications, computers, electronic circuits, fiberoptics, microelectronics, medical electronics,… …   Wikipedia

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • EigenTrust — algorithm is a reputation management algorithm for peer to peer networks, developed by Sep Kamvar, Mario Schlosser, and Hector Garcia Molina. The algorithm provides each peer in the network a unique global trust value based on the peer s history… …   Wikipedia

  • Tessellation — A tessellation of pavement A honeycomb is an example of a t …   Wikipedia

  • Trahtman, Avraham — ▪ 2009 Avraham Trakhtman  born Feb. 10, 1944, Kalinovo, Sverdlovsk oblast, U.S.S.R. [now in Russia]   The astonishing news emerged in 2008 that in September 2007 a 63 year old Israeli mathematician, Avraham Trahtman, had solved a long standing… …   Universalium

  • Cryptanalysis — Close up of the rotors in a Fialka cipher machine Cryptanalysis (from the Greek kryptós, hidden , and analýein, to loosen or to untie ) is the study of methods for obtaining the meaning of encrypted information, without access to the secret… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»